key compression - перевод на арабский
DICLIB.COM
Языковые инструменты на ИИ
Введите слово или словосочетание на любом языке 👆
Язык:     

Перевод и анализ слов искусственным интеллектом

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

key compression - перевод на арабский

CONCEPT IN COMPUTER DATA COMPRESSION
Asymmetric compression; Symmetric compression

key compression      
ضغط المفاتيح
major key         
  • ii-V<sup>7</sup>-I progression]] in C [[File:Ii-V-I turnaround in C.mid]]
TONIC NOTE AND CHORD OF A MUSICAL PIECE
Major key; Key (Music); Musical key; Major Key; Key of D; Musical keys; Key coloration; Key relationship; Musical Key; Music key; Minor-key; Minor–key; Major-key; Key of E
مفتاح موسيقى كبير المفتاح الرئيس في سجل.
lossy compression         
DATA COMPRESSION APPROACH THAT RESULTS IN LOSS OR CHANGE OF SOME DATA
Lossy; Lossy encoding; Lossy data compression; Data compression/lossy; List of lossy compression methods; Irreversible compression
الضغط الفاقد ـ الإنضغاط الفاقد

Определение

lossy
<algorithm> A term describing a data compression algorithm which actually reduces the amount of information in the data, rather than just the number of bits used to represent that information. The lost information is usually removed because it is subjectively less important to the quality of the data (usually an image or sound) or because it can be recovered reasonably by interpolation from the remaining data. MPEG and JPEG are examples of lossy compression techniques. Opposite: lossless. (1995-03-29)

Википедия

Data compression symmetry

Symmetry and asymmetry, in the context of data compression, refer to the time relation between compression and decompression for a given compression algorithm.

If an algorithm takes the same time to compress a data archive as it does to decompress it, it is considered symmetrical. Note that compression and decompression, even for a symmetric algorithm, may not be perfectly symmetric in practice, depending on the devices the data is being copied to and from, and other factors such as latency and the fragmentation on the device.

In turn, if the compression and decompression times of an algorithm are vastly different, it is considered asymmetrical.